Planar graph vertex partition for linear problem kernels
نویسندگان
چکیده
منابع مشابه
vertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملLinear Problem Kernels for NP-Hard Problems on Planar Graphs
We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for Connected Vertex Cover, Minimum Edge Dominating Set,Maximum Triangle Packing, and Efficient Dominating Set on planar graphs. On the route to these results, we present e...
متن کاملSimple Planar Graph Partition into Three Forests
We describe a simple way of partitioning a planar graph into three edge-disjoint forests in O(n log n) time, where n is the number of its vertices. We can use this partition in Kannan et al.‘s graph representation (1992) to label the planar graph vertices so that any two vertices’ adjacency can be tested locally by comparing their names in constant time.
متن کاملInserting a vertex into a planar graph
We consider the problem of computing a crossing minimum drawing of a given planar graph G = (V, E) augmented by a star, i.e., an additional vertex v together with its incident edges Ev = {(v, u) | u ∈ V }, in which all crossings involve Ev. Alternatively, the problem can be stated as finding a planar embedding of G, in which the given star can be inserted requiring the minimum number of crossin...
متن کاملLinear vertex-kernels for several dense ranking r-CSPs
A ranking r-constraint satisfaction problem (ranking r-CSP for short) consists of a ground set of vertices V , an arity r > 2, a parameter k ∈ N and a constraint system c, where c is a function which maps rankings of r-sized sets S ⊆ V to {0, 1}. The objective is to decide if there exists a ranking σ of the vertices satisfying all but at most k constraints (i.e. ∑ S⊆V,|S|=r c(σ(S)) 6 k). Famous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2013
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2012.08.001